On the number of dominating Fourier coefficients of two newforms
نویسندگان
چکیده
منابع مشابه
On the number of dominating Fourier coefficients of two newforms
Let f = ∑ n≥1 λf (n)n (k1−1)/2qn and g = ∑ n≥1 λg(n)n (k2−1)/2qn be two newforms with real Fourier coeffcients. If f and g do not have complex multiplication and are not related by a character twist, we prove that #{n ≤ x | λf (n) > λg(n)} x.
متن کاملthe effect of taftan pozzolan on the compressive strength of concrete in the environmental conditions of oman sea (chabahar port)
cement is an essential ingredient in the concrete buildings. for production of cement considerable amount of fossil fuel and electrical energy is consumed. on the other hand for generating one tone of portland cement, nearly one ton of carbon dioxide is released. it shows that 7 percent of the total released carbon dioxide in the world relates to the cement industry. considering ecological issu...
a case study of the two translators of the holy quran: tahereh saffarzadeh and laleh bakhtiar
بطورکلی، کتاب های مقدسی همچون قران کریم را خوانندگان میتوان مطابق با پیش زمینه های مختلفی که درند درک کنند. محقق تلاش کرده نقش پیش زمینه اجتماعی-فرهنگی را روی ایدئولوژی های مترجمین زن و در نتیجه تاثیراتش را روی خواندن و ترجمه آیات قرآن کریم بررسی کند و ببیند که آیا تفاوت های واژگانی عمده ای میان این مترجمین وجود دارد یا نه. به این منظور، ترجمه 24 آیه از آیات قرآن کریم مورد بررسی مقایسه ای قرار ...
15 صفحه اولthe evaluation and comparison of two esp textbooks available on the iranian market for teaching english to the students of medicine
abstract this study evaluated and compared medical terminology and english for the students of medicine (ii) as two representatives of the textbooks available on the iranian market for teaching english to the students of medicine. this research was performed on the basis of a teacher’s and a number of students’ attitudes and the students’ needs analysis for two reasons: first, to investigate...
15 صفحه اولOn the Maximum Number of Dominating Classes in Graph Coloring
In this paper we investigate the dominating- -color number، of a graph G. That is the maximum number of color classes that are also dominating when G is colored using colors. We show that where is the join of G and H. This result allows us to construct classes of graphs such that and thus provide some information regarding two questions raised in [1] and [2].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2018
ISSN: 0002-9939,1088-6826
DOI: 10.1090/proc/14145